Pii: S0168-8510(01)00237-8
نویسندگان
چکیده
Fairness is a key goal of priority setting and ‘accountability for reasonableness’ has emerged as the leading framework for fair priority setting. However, it has not been shown acceptable to those engaged in priority setting. In particular, since it was developed in the context of a primarily privately funded health system, its applicability in a primarily publicly funded system is uncertain. In this paper, we describe elements of fairness identified by decision-makers engaged in priority setting for new technologies in Canada (a primarily publicly funded system). According to these decision makers, accountability for reasonableness is acceptable and applicable. Our findings also provide refinements to accountability for reasonableness. © 2002 Elsevier Science Ireland Ltd. All rights reserved.
منابع مشابه
Pii: S0168-8510(01)00219-6
In order to provide tailor-made care, governments are considering the implementation of output-pricing based on hospital case-mix measures, such as diagnosis related groups (DRG). The question is whether the current DRG classification system can provide a satisfactory prediction of the variance of costs in stroke patients and if not, in what way other variables may enhance this prediction. In t...
متن کاملPii: S0168-9274(01)00134-9
A postprocessing technique to improve the accuracy of Galerkin methods, when applied to dissipative partial differential equations, is examined in the particular case of very smooth solutions. Pseudospectral methods are shown to perform poorly. This performance is studied and a refined postprocessing technique is proposed. 2002 IMACS. Published by Elsevier Science B.V. All rights reserved.
متن کاملOn a finitary version of mathematical analysis
An approach to constructing counterparts of some #elds of mathematical analysis in the frames of Pilbert’s “#nitary standpoint” is sketched in this paper. This approach is based on certain results of functional spaces theory development in classical mathematics. c © 2002 Elsevier Science B.V. All rights reserved. MSC: 03A05; 03F60; 26E40; 46S30
متن کاملPii: S0168-9274(01)00131-3
We present in this paper optimal and accelerated row projection algorithms arising from the use of quadratic programming, that allow us to define the iterate xk+1 as the projection of x onto a hyperplane which minimizes its distance to the solution x∗. These algorithms also use a novel partition strategy into blocks based on sequential estimations of their condition numbers. 2001 IMACS. Publi...
متن کاملExtending the system T0 of explicit mathematics: the limit and Mahlo axioms
In this paper we discuss extensions of Feferman’s theory T0 for explicit mathematics by the so-called limit and Mahlo axioms and present a novel approach to constructing natural recusion-theoretic models for (fairly strong) systems of explicit mathematics which is based on nonmonotone inductive definitions.
متن کامل